/**
 * 0509
 *  
 * @Author : roryrywang
 * @DateTime : 2024/8/16 0:19
 */

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class Solution {
public:
    int fib(int n) {
        if (n == 0 || n == 1)return n;
        int f[n + 1];
        f[0] = 0;
        f[1] = 1;
        for (int i = 2; i <= n; ++i) {
            f[i] = f[i - 1] + f[i - 2];
        }
        return f[n];
    }
};

int main() {

    return 0;
}